Iterative Rotations and Assignments (IRA): A shape matching algorithm for atomic structures
نویسندگان
چکیده
IRA is a Fortran library that solves the shape matching problem for atomic structures, stored as sets of points representing positions. In case exact- and near-congruence, provides optimal rigid transformation between given by assignments, rotation/reflection matrix, translation vector. also able to operate on structures containing non-equal number atoms, i.e. structure any its fragments. Any application requires solution could benefit from IRA.
منابع مشابه
Matching hierarchical structures for shape recognition
In this thesis we aim to develop a framework for clustering trees and representing and learning a generative model of graph structures from a set of training samples. The approach is applied to the problem of the recognition and classification of shape abstracted in terms of its morphological skeleton. We make five contributions. The first is an algorithm to approximate tree edit-distance using...
متن کاملA Parallel Iterative Improvement Stable Matching Algorithm
In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem as an optimization problem with all possible matchings forming its solution space. Since a stable matching always exists for any stable matching problem instance, finding a stable matching is equivalent to finding a matching wit...
متن کاملA Simple Algorithm for Maximum Clique and Matching Protein Structures
The maximum common subgraph (MCS) problem has become increasingly important in matching protein structures of two proteins. Two proteins represented as graphs by simple contact map and product of these graphs was input to the proposed algorithm. A maximum clique in the product graph, found by the proposed algorithm, provides a measure of the structural similarity between the two proteins. The p...
متن کاملA Branch and Bound Algorithm for Matching Protein Structures
An efficient branch and bound algorithm for matching protein structures has been developed. The compared protein structures are represented as graphs and a product graph of these graphs is calculated. The resulting product graph is then the input to our algorithm. A maximum clique in the product graph corresponds to the maximum common substructure in the original graphs. Our algorithm, which gi...
متن کاملA Combinatorial Shape Matching Algorithm for Rigid Protein Docking
The protein docking problem is to predict the structure of protein-protein complexes from the structures of individual proteins. It is believed that shape complementarity plays a dominant role in protein docking. Recently, it has been shown empirically by Bespamaytnikh et al [4] that the shape complementarity (measured by a score function) is sufficient for the bound protein docking problem, in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software impacts
سال: 2022
ISSN: ['2665-9638']
DOI: https://doi.org/10.1016/j.simpa.2022.100264